A DTD Graph Based XPath Query Subsumption Test
نویسندگان
چکیده
XPath expressions play a central role in querying for XML fragments. We present a containment test of two XPath queries which checks whether a new XPath query XP1 can reuse a previous query result XP2. The key idea is to transform XP1 into a graph which is used to search for sequences of elements which are used in the XPath query XP2.
منابع مشابه
Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients
Within mobile client-server applications which access a server-side XML database, XPath expressions play a central role in querying for XML fragments. Whenever the mobile client can use a locally stored previous query result in order to answer a new query instead of accessing the server-side database, this can significantly reduce the data transfer from the server to the client. In order to che...
متن کاملOptimized Internet Search Based on a Intersection Test for XPath Expressions under a DTD
Whenever XML data is distributed over several web sites but follows a global schema defined by a DTD, i.e. multiple sites contain fragments of a global ‘virtual’ XML document, and the accessible XML content stored on a site can be described by an XPath expression, it may be considerably advantageous to search for XML data only on those sites which contain a relevant fragment of the distributed ...
متن کاملTransforming XPath Expressions into Relational Algebra Expressions With Kleene Closure
In the problem of translating XPath expressions into SQL queries, the most challenging part is to find a way to minimize the use of least fixpoint (LFP) operators when a DTD graph contains cycles. In this paper, we address this issue and present a new algorithm to do the task based on the recognition of a kind of DTD graphs, which can be reduced to a single node by contracting nodes into their ...
متن کاملA Decision Procedure for XPath Satisfiability in the Presence of DTD Containing Choice
XPath satisfiability is one of the most basic problems of XML query optimization. A satisfiability decision framework, named SAT-DTD, is proposed to determine, given a set of XPath queries P and a DTD τ, which subset of P are satisfiable by an XML tree conforming to DTD τ. In the framework, an indexed NFA is constructed from the set of XPath queries P, and then the NFA is driven by simple API f...
متن کاملMapping XML Fragments to Community Web Ontologies
The C-Web (Community Web)1 project [2] aims at supporting the sharing, integration and retrieval of information in a specific domain of interest for a group of people who desire to access and exchange knowledge and information in this domain. A C-Web portal (or mediator) provides the infrastructure for (1) publishing information sources and (2) formulating structured queries by taking into cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003